Hybrid Ant System Algorithm for Solving Quadratic Assignment Problems
نویسندگان
چکیده
-In this paper a hybrid variant of meta-heuristic algorithm ant colony optimization (ACO) is used. Approximate solutions to quadratic assignment problem have been proved very efficient. Different variants of ant colony optimization have been applied to QAP. But in this paper a hybrid approach is proposed which is combination of Ant system and Max-Min Ant system to take benefits of both the methods. In this approach solution construction phase is in accordance with Max-Min system and pheromone updation phase is according to Ant System. This hybrid approach is accompanied by local search technique. In this paper a comparative analysis is done using QAPLIB and it is found that results are improved and are comparable with Ant system and Max-Min ant system algorithm.
منابع مشابه
A Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in many fields. Many real world applications such as backboard wiring, typewriter keyboard design and scheduling can be formulated as QAPs. Ant colony algorithm is a multi-agent system inspired by behaviors of real ant colonies to solve optimization problems. Ant colony optimization (ACO) is one of new ...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملA Multi Hybrid Genetic Algorithm for the Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of the hardest combinatorial optimization problems which can model many real life problems. Because of its theoretical and practical importance, QAP has attracted attention of many researchers. In this paper, a multi hybrid genetic algorithm for solving QAP is proposed. The key feature of our approach is the hybridization of three metaheuristics, tabu s...
متن کاملThe Ant System Applied to the Quadratic Assignment Problem
ÐIn recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures that can solve complex problems. In this article, we describe a distributed heuristic algorithm that was inspired by the observation of the behavior of ant colonies, and we propose its use for the Quadratic Assignment Problem. The results obtained i...
متن کامل